Algebraic 3 × 3 , 4 × 4 and 6 × 6 Space - Time Codes with non - vanishing Determinants
نویسندگان
چکیده
In this paper we present algebraic constructions of 3×3, 4× 4 and 6 × 6 Space-Time Codes, achieving full rate and full diversity. These codes have non-vanishing (in fact fixed) minimum determinants when the rate goes to infinity. Their construction is based on cyclic algebras with center equal to an algebraic field based on cyclotomic fields .
منابع مشابه
Algebraic Methods for Channel Coding
This work is dedicated to developing algebraic methods for channel coding. Its goal is to show that in different contexts, namely single-antenna Rayleigh fading channels, coherent and non-coherent MIMO channels, algebraic techniques can provide useful tools for building efficient coding schemes. Rotated lattice signal constellations have been proposed as an alternative for transmission over the...
متن کاملPerfect Space-Time Codes for Any Number of Antennas
In a recent paper, perfect (n×n) space-time codes were introduced as the class of linear dispersion space-time codes having full rate, non-vanishing determinant, a signal constellation isomorphic to either the rectangular or hexagonal lattices in 2n dimensions and uniform average transmitted energy per antenna. Consequence of these conditions include optimality of perfect codes with respect to ...
متن کاملm / 9 60 40 12 v 1 1 9 A pr 1 99 6 ELEMENTARY COUNTEREXAMPLES TO KODAIRA VANISHING IN PRIME CHARACTERISTIC
Using methods from the modular representation theory of algebraic groups one can construct [1] a projective homogeneous space for SL 4 in prime characteristic , which violates Kodaira vanishing. In this note we show how elementary algebraic geometry can be used to simplify and generalize this example. Let X be a smooth projective variety of dimension m over an algebraically closed field of char...
متن کاملThe equivalence of space-time codes and codes defined over finite fields and Galois rings
Space-time codes for a wide variety of channels have the property that the diversity of a pair of codeword matrices is measured by the vanishing or non-vanishing of polynomials in the entries of the matrices. We show that for every such channel: I) There is an appropriately-defined notion of approximation of space-time codes such that each code is arbitrarily well approximated by one whose alph...
متن کاملConstructions of algebraic lattices
In this work we present constructions of algebraic lattices in Euclidean space with optimal center density in dimensions 2, 3, 4, 6, 8 and 12, which are rotated versions of the lattices 3n , for n = 2, 3, 4, 6, 8 and K12. These algebraic lattices are constructed through twisted canonical homomorphism via ideals of a ring of algebraic integers. Mathematical subject classification: 18B35, 94A15, ...
متن کامل